# model to find a violated cover, given a fractional solution y
# z[i] should be set to 1 if item i is in the violated cover
# and zero otherwise. 

minimize violation1: sum {i in N} (1-y[i])*z[i];

subject to is_a_cover1:
sum{i in N} inputdata[i,'Weight']*z[i]>= MaxCapacity + 1; #assumes integer data

